Extremal Sets Minimizing Dimension-Normalized Boundary in Hamming Graphs
نویسندگان
چکیده
منابع مشابه
Extremal Sets Minimizing Dimension-normalized Boundary in Hamming Graphs∗
We prove that the set of first k vertices of a Hamming graph in reverse-lexicographic order constitutes an extremal set minimizing the dimension-normalized edge-boundary over all kvertex subsets of the graph. This generalizes a result of Lindsey and can be used to prove a tight lower bound for the isoperimetric number and the bisection width of arrays.
متن کاملExtremal Regular Graphs: Independent Sets and Graph Homomorphisms
This survey concerns regular graphs that are extremal with respect to the number of independent sets, and more generally, graph homomorphisms. The main motivating problem is the following: in the family of d-regular graphs, which graph G maximize/minimize the quantity i(G), the number of independent sets in G normalized exponentially by the size of G? What if i(G) is replaced by some other grap...
متن کاملNew Similarity Measures of Fuzzy Soft Sets Based on Distance Measures
Similarity measure is a very important problem in fuzzy soft set theory. In this paper, seven similarity measures of fuzzy soft sets are introduced, which are based on the normalized Hamming distance, the normalized Euclidean distance, the generalized normalized distance, the Type-2 generalized normalized distance, the Type-2 normalized Euclidean distance, the Hausdorff distance and the Chebysh...
متن کاملShattering-Extremal Set Systems of VC Dimension at most 2
We say that a set system F ⊆ 2[n] shatters a given set S ⊆ [n] if 2S = {F ∩ S : F ∈ F}. The Sauer inequality states that in general, a set system F shatters at least |F| sets. Here we concentrate on the case of equality. A set system is called shattering-extremal if it shatters exactly |F| sets. In this paper we characterize shattering-extremal set systems of Vapnik-Chervonenkis dimension 2 in ...
متن کاملHamming dimension of a graph - The case of Sierpiński graphs
The Hamming dimension of a graph G is introduced as the largest dimension of a Hamming graph into which G embeds as an irredundant induced subgraph. An upper bound is proved for the Hamming dimension of Sierpiński graphs S k , k ≥ 3. The Hamming dimension of S 3 grows as 3. Several explicit embeddings are constructed along the way, in particular into products of generalized Sierpiński triangle ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 17 شماره
صفحات -
تاریخ انتشار 2003